The Classification of Hypersmooth Borel Equivalence Relations

نویسندگان

  • ALEXANDER S. KECHRIS
  • ALAIN LOUVEAU
چکیده

This paper is a contribution to the study of Borel equivalence relations in standard Borel spaces, i.e., Polish spaces equipped with their Borel structure. A class of such equivalence relations which has received particular attention is the class of hyperfinite Borel equivalence relations. These can be defined as the increasing unions of sequences of Borel equivalence relations all of whose equivalence classes are finite or, as it turns out, equivalently those induced by the orbits of a single Borel automorphism. Hyperfinite equivalence relations have been classified in [DJK], under two notions of equivalence, Borel bi-reducibility, and Borel isomorphism. An equivalence relation E on X is Borel reducible to an equivalence relation F on Y if there is a Borel map f : X → Y with xEy ⇔ f(x)Ff(y). We write then E ≤ F . If E ≤ F and F ≤ E we say that E,F are Borel bi-reducible, in symbols E ≈∗ F . When E ≈∗ F the quotient spaces X/E, Y/F have the same “effective” or “definable” cardinality. We say that E,F are Borel isomorphic if there exists a Borel bijection f : X → Y with xEy ⇔ f(x)Ff(y). Below we denote by E0, Et the equivalence relations on the Cantor space 2 N given by: xE0y ⇔ ∃n∀m ≥ n(xm = ym), xEty ⇔ ∃n∃k∀m(xn+m = yk+m). We denote by ∆X the equality relation on X , and finally we call E smooth if E ≤ ∆2N . This just means that elements of X can be classified up to E-equivalence by concrete invariants which are members of some Polish space. It is shown now in [DJK] that up to Borel bi-reducibility there is exactly one non-smooth hyperfinite Borel E, namely E0, and up to Borel isomorphism there are exactly countably many non-smooth hyperfinite aperiodic (i.e., having no finite equivalence classes) Borel E, namely Et, E0 ×∆n (1 ≤ n ≤ א0), E0 ×∆2N (where ∆n = ∆X , with card(X) = n, if 1 ≤ n ≤ א0). In this paper we investigate and classify the class of Borel equivalence relations which are the “continuous” analogs of the hyperfinite ones. We call a Borel equivalence relation E hypersmooth if it can be written as E = ⋃ nEn, where E0 ⊆ E1 ⊆ · · · is an increasing sequence of smooth Borel equivalence relations. These have been also studied (in a measure theoretic context) in the Russian literature under the name tame equivalence relations. They include many interesting examples such as: The increasing union of a sequence of closed or even Gδ equivalence relations (like for example the coset equivalence relation of a Polish group modulo a subgroup, which is the increasing union of a sequence of closed subgroups), the hyperfinite equivalence relations, the “tail” equivalence relations

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Essential countability of treeable equivalence relations

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially countable if and only if there is no continuous embedding of E1 into E. Our techniques also yield the first classical proof of the analogous result for hypers...

متن کامل

Some Applications of the Adams-kechris Technique

We analyze the technique used by Adams and Kechris (2000) to obtain their results about Borel reducibility of countable Borel equivalence relations. Using this technique, we show that every Σ1 equivalence relation is Borel reducible to the Borel bi-reducibility of countable Borel equivalence relations. We also apply the technique to two other classes of essentially uncountable Borel equivalence...

متن کامل

Linear Algebraic Groups and Countable Borel Equivalence Relations Scot Adams and Alexander S. Kechris

This paper is a contribution to the study of Borel equivalence relations on standard Borel spaces (i.e., Polish spaces equipped with their Borel structure). In mathematics one often deals with problems of classification of objects up to some notion of equivalence by invariants. Frequently these objects can be viewed as elements of a standard Borel space X and the equivalence turns out to be a B...

متن کامل

A Dichotomy for the Mackey Borel Structure

We prove that the equivalence of pure states of a separable C*-algebra is either smooth or it continuously reduces [0, 1]N/l2 and it therefore cannot be classified by countable structures. The latter was independently proved by Kerr–Li–Pichot by using different methods. We also give some remarks on a 1967 problem of Dixmier. If E and F are Borel equivalence relations on Polish spaces X and Y , ...

متن کامل

How Many Turing Degrees are There ?

A Borel equivalence relation on a Polish space is countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence rel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996